From Self- to Self-stabilizing with Service Guarantee 1-hop Weight-Based Clustering
نویسندگان
چکیده
We propose a transformer building a silent self-stabilizing with service guarantee 1-hop clustering protocol T P of an input silent self-stabilizing 1-hop clustering protocol P. From an arbitrary configuration, T P reaches a safe configuration in at most 3 rounds, where the following useful minimal service is provided: “each node belongs to a 1-hop cluster having an effective leader”. During stabilization of T P, the minimal service is preserved, so the clustering structure is available throughout the entire network. The minimal service is also maintained despite the occurrences of some external disruptions, called highly tolerated disruptions, denoted HT D. T P reaches a terminal (also legitimate) configuration in at most 4∗SP rounds where SP is the stabilization time of P protocol. Moreover, T P requires only 2 bits per node more than P.
منابع مشابه
Self-stabilizing with service guarantee construction of 1-hop weight-based bounded size clusters
This paper makes contributions in two areas. First, we introduce an extended approach of self-stabilization, called self-stabilization with service guarantee. A self-stabilizing system tolerates transient faults: it automatically recovers to a correct behavior after a stabilization period. However, during stabilization periods, no property on the system behavior is guaranteed. A self-stabilizin...
متن کاملRobust self-stabilizing weight-based clustering algorithm
Ad hoc networks consist of wireless hosts that communicate with each other in the absence of a fixed infrastructure. Such networks cannot rely on centralized and organized network management. The clustering problem consists of partitioning network nodes into non-overlapping groups called clusters. Clusters give a hierarchical organization to the network that facilitates the network management a...
متن کاملA MAC Layer Protocol for Priority-based Reliable Broadcast in Wireless Ad Hoc Networks
RTS-CTS handshake based protocols achieve “reliable unicast” by eliminating the hidden node problem effectively, however, these solutions are not directly or efficiently generalizable for solving the single-hop “reliable broadcast” problem, and broadcast remains as a best-effort operation in wireless ad hoc networks. Here we present a simple, light-weight, and self-stabilizing MAC protocol, nam...
متن کاملBrief Announcement: Robust Self-stabilizing Construction of Bounded Size Weight-Based Clusters
We propose the first robust self-stabilizing protocol building 1-hop clusters whose size is bounded, moreover the clusterhead selection is weight-based. The protocol reaches quickly (in 4 rounds) a safe configuration, where the safety property is satistfied: network nodes are partitionned into bounded clusters (clusterheads are not the most suitable nodes). During the convergence to a legitimat...
متن کاملRobust Self-Stabilizing construction of bounded size weight-based clusters Rapport de Recherche LRI No 1518
An Ad hoc network consists of wireless hosts that communicate with each other in the absence of a fixed infrastructure. Such networks cannot rely on centralized and organized network management. The clustering problem consists of partitionning network nodes into non-overlapping groups called clusters. Clusters give a hierarchical organisation to the network that facilitates network management a...
متن کامل